/*
 * Copyright 2011 Fabian Wenzelmann
 * 
 * This file is part of Recognition-Procedures-for-Boolean-Functions.
 * 
 * Recognition-Procedures-for-Boolean-Functions is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 * 
 * Recognition-Procedures-for-Boolean-Functions is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with Recognition-Procedures-for-Boolean-Functions.  If not, see <http://www.gnu.org/licenses/>.
 */

package de.wenzelmf.booleanFunction.lpb.combinatorial.occurrencePattern;

/**
 * This interace provides methods to create new occurrence patterns.
 * 
 * @author Fabian Wenzelmann
 * @version 1.0
 *
 */
public interface OccurrencePatternFactory
{
	/**
	 * Returns a new empty instance for a variable.
	 * 
	 * @param identifier The identifier of the variable.
	 * 
	 * @return A new empty OccurrencePattern for the corresponding variable.
	 */
	public OccurrencePattern getEmptyInstance(String identifier);
	
	/**
	 * Return a new empty instance given an initial size (slots in the set).
	 * 
	 * @param identifier The identifier of the variable.
	 * @param initialSize The initial amount of slots.
	 * @return A new empty OccurrencePattern for the corresponding variable.
	 */
	public OccurrencePattern getEmptyInstance(String identifier, int initialSize);
	
}
